Solving Knapsack Problems with Attribute Grammars
نویسندگان
چکیده
We present a work in progress describing attribute grammar approaches to Grammatical Evolution, which allow us to encode context-sensitive and semantic information. Performance of the different grammars adopted are directly compared with a more traditional GA representation on five instances of an NP-hard knapsack problem. The results presented are encouraging, demonstrating that Grammatical Evolution in conjunction with alternative grammar representations can provide an improvement over the standard context-free grammar, and allow Grammatical Evolution to drive a constraint based search.
منابع مشابه
A dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملAn Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem
We describe how the standard genotype-phenotype mapping process of Grammatical Evolution (GE) can be enhanced with an attribute grammar to allow GE to operate as a decoder-based Evolutionary Algorithm (EA). Use of an attribute grammar allows GE to maintain context-sensitive and semantic information pertinent to the capacity constraints of the 01 Multiconstrained Knapsack Problem (MKP). An attri...
متن کاملStochastic Knapsack Problems
In this paper we study and solve two different variants of static knapsack problems with random weights: The stochastic knapsack problem with simple recourse as well the stochastic knapsack problem with probabilistic constraint. Special regard is given the corresponding continuous problems and three different problem solving methods are presented. The resolution of the continuous problems serve...
متن کاملSolving Single and Multiple Plant Sourcing Problems with a Multidimensional Knapsack Model
This research addresses sourcing decisions and how those decisions can affect the management of a company's assets. The study begins with a single-plant problem, in which one facility chooses, from a list of parts, which parts to bring in-house. The selection is based on maximizing the value of the selected parts, while remaining within the plant's capacity. This problem is defined as the insou...
متن کاملA New Balancing and Ranking Method based on Hesitant Fuzzy Sets for Solving Decision-making Problems under Uncertainty
The purpose of this paper is to extend a new balancing and ranking method to handle uncertainty for a multiple attribute analysis under a hesitant fuzzy environment. The presented hesitant fuzzy balancing and ranking (HF-BR) method does not require attributes’ weights through the process of multiple attribute decision making (MADM) under hesitant conditions. For the rating of possible alternati...
متن کامل